Statistical Mechanical Systems on Complete Graphs, Infinite Exchangeability, Finite Extensions and a Discrete Finite Moment Problem

نویسندگان

  • Thomas M. Liggett
  • Jeffrey E. Steif
چکیده

We show that a large collection of statistical mechanical systems with quadratically represented Hamiltonians on the complete graph can be extended to infinite exchangeable processes. This extends a known result for the ferromagnetic Curie–Weiss Ising model and includes as well all ferromagnetic Curie–Weiss Potts and Curie–Weiss Heisenberg models. By de Finetti’s theorem, this is equivalent to showing that these probability measures can be expressed as averages of product measures. We provide examples showing that “ferromagnetism” is not however in itself sufficient and also study in some detail the Curie–Weiss Ising model with an additional 3-body interaction. Finally, we study the question of how much the antiferromagnetic Curie–Weiss Ising model can be extended. In this direction, we obtain sharp asymptotic results via a solution to a new moment problem. We also obtain a “formula” for the extension which is valid in many cases.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Statistical Mechanical Systems on Complete Graphs, Infinite Exchangeability, Finite Extensions and a Discrete Finite Moment Problem By

We show that a large collection of statistical mechanical systems with quadratically represented Hamiltonians on the complete graph can be extended to infinite exchangeable processes. This extends a known result for the ferromagnetic Curie–Weiss Ising model and includes as well all ferromagnetic Curie–Weiss Potts and Curie–Weiss Heisenberg models. By de Finetti’s theorem, this is equivalent to ...

متن کامل

Optimal Finite-time Control of Positive Linear Discrete-time Systems

This paper considers solving optimization problem for linear discrete time systems such that closed-loop discrete-time system is positive (i.e., all of its state variables have non-negative values) and also finite-time stable. For this purpose, by considering a quadratic cost function, an optimal controller is designed such that in addition to minimizing the cost function, the positivity proper...

متن کامل

Entropy of infinite systems and transformations

The Kolmogorov-Sinai entropy is a far reaching dynamical generalization of Shannon entropy of information systems. This entropy works perfectly for probability measure preserving (p.m.p.) transformations. However, it is not useful when there is no finite invariant measure. There are certain successful extensions of the notion of entropy to infinite measure spaces, or transformations with ...

متن کامل

Computing Simulations on Finite and Infinite Graphs

We present algorithms for computing similarity relations of labeled graphs. Similarity relations have applications for the refinement and verification of reactive systems. For finite graphs, we present an O(mn) algorithm for computing the similarity relation of a graph with n vertices and m edges (assuming m 2 n). For effectively presented infinite graphs, we present a symbolic similarity-check...

متن کامل

All minimal prime extensions of hereditary classes of graphs

The substitution composition of two disjoint graphs G1 and G2 is obtained by first removing a vertex x from G2 and then making every vertex in G1 adjacent to all neighbours of x in G2. Let F be a family of graphs defined by a set Z of forbidden configurations. Giakoumakis [V. Giakoumakis, On the closure of graphs under substitution, Discrete Mathematics 177 (1997) 83–97] proved that F, the clos...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005